A note on a sports league scheduling problem
نویسندگان
چکیده
Sports league scheduling is a difficult task in the general case. In this short note, we report two improvements to an existing enumerative search algorithm for a NP-hard sports league scheduling problem known as “prob026” in CSPLib. These improvements are based on additional rules to constraint and accelerate the enumeration process. The proposed approach is able to find a solution (schedule) for all prob026 instances for a number T of teams ranging from 12 to 70, including several T values for which a solution is reported for the first time.
منابع مشابه
The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling
With the recent inclusion of inter-league games to professional sports leagues, a natural question is to determine the “best possible” inter-league schedule that retains all of the league’s scheduling constraints to ensure competitive balance and fairness, while minimizing the total travel distance for both economic and environmental efficiency. To answer that question, this paper introduces th...
متن کاملSports League Scheduling: Enumerative Search for Prob026 from CSPLib
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the best known constraint programing algorithm is limited to T ≤ 40. The proposed approach relies on interesting properties which are used to constraint the search process.
متن کاملScheduling Major League Baseball Umpires and the Traveling Umpire Problem
The scheduling needs of umpires and referees differ from the needs of sports teams. In some sports leagues, such as Major League Baseball in the United States, umpires travel throughout the league’s territory; they do not have a “home base.” For such leagues, balancing the need to minimize umpire travel and the objective that an umpire should not handle the games of a particular team too freque...
متن کاملA Note on Complexity of Traveling Tournament Problem
Sports league scheduling problems have gained considerable amount of attention in recent years due to its huge applications and challenges. Traveling Tournament problem, proposed by Trick et. al. (2001), is a problem of scheduling round robin leagues which minimizes the total travel distance maintaining some constraints on consecutive home and away matches. No good algorithm is known to tackle ...
متن کاملSolving the Sports League Scheduling Problem with Tabu Search
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisfaction Problem (CSP). Tests were carried out on problem instances of up to 40 teams representing 780 integer variables with 780 values per variable. Experimental results show that this approach outperforms some existi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1410.2721 شماره
صفحات -
تاریخ انتشار 2014